Reliable Node Clustering for Mobile Ad Hoc Networks
نویسندگان
چکیده
منابع مشابه
Reliable Node Clustering for Mobile Ad Hoc Networks
Mobile ad hoc networks (MANETs) are gaining popularity in recent years due to their flexibility, the proliferation of smart computing devices, and developments in wireless communications. Due to the mobile nature of the network, creating reliable clusters that can sustain for long period of time is a challenging problem. In this paper, we use probabilistic analysis to guide our clustering algor...
متن کاملTowards Reliable Mobile Ad Hoc Networks
It is expected that future networks will interconnect an even larger number of devices then today, ranging from servers to micro-devices embedded in objects. These devices will provide useful services thanks to the possibility of a networked operation, for example, localization services to support a variety of situation-aware applications. A very significant number of these devices will be carr...
متن کاملReliable Routing in Mobile Ad-Hoc Networks
We propose that a new parameter, the set of link stability functions, should be taken into consideration when selecting a route for reliable data transmission in an Ad Hoc Network. Due to this parameter, any proposed routing algorithm must explicitly take into consideration the data transmission method. Polynomial time routing algorithms for both the store-forward and cut-through methods are pr...
متن کاملA Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks
Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...
متن کاملClustering Algorithm in Mobile Ad Hoc Networks
In this paper we consider an example of usage of SAT solvers for the problem of sensor placement as a testbed for intelligent algorithms. In particular, we consider a clustering algorithm in mobile ad hoc networks. The problem of sensor placement (SP) received a lot of attention recently (see e.g. [1, 2]). Note that many different formalizations of sensor placement is extensively used for impro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2013
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2013/285967